Normalization by Evaluation with Typed Abstract Syntax
نویسندگان
چکیده
منابع مشابه
Normalization by evaluation with typed abstract syntax
We present a simple way to implement typed abstract syntax for the lambda calculus in Haskell, using phantom types, and we specify normalization by evaluation (i.e., type-directed partial evaluation) to yield this typed abstract syntax. Proving that normalization by evaluation preserves types and yields normal forms then reduces to type-checking the specification.
متن کاملExtended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of “models”, yielding induction and recursion principles for abstract syntax. Zsidó [Zsi10, Chap. 6] proves an initiality result for simply–typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. ...
متن کاملNormalization by Evaluation for Typed Lambda Calculus with Coproducts
Abstract We solve the decision problem for simply typed lambda calculus with strong binary sums, equivalently the word problem for free cartesian closed categories with binary coproducts. Our method is based on the semantical technique known as “normalization by evaluation” and involves inverting the interpretation of the syntax into a suitable sheaf model and from this extracting appropriate u...
متن کاملTyped Applicative Structures and Normalization by Evaluation for System Fomega
We present a normalization-by-evaluation (NbE) algorithm for System F with βη-equality, the simplest impredicative type theory with computation on the type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, ca...
متن کاملTyped Applicative Structures and Normalization by Evaluation for System F
We present a normalization-by-evaluation (NbE) algorithm for System F with βη-equality, the simplest impredicative type theory with computation on the type level. Values are kept abstract and requirements on values are kept to a minimum, allowing many different implementations of the algorithm. The algorithm is verified through a general model construction using typed applicative structures, ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2001
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v8i16.20473